Stochastic rumors on random trees

نویسندگان

چکیده

The Maki-Thompson rumor model is defined by assuming that a population represented graph subdivided into three classes of individuals; namely, ignorants, spreaders and stiflers. A spreader tells the to any its nearest ignorant neighbors at rate one. At same rate, becomes stifler after contact with other neighbor spreaders, or In this work we study on random trees. As usual define critical parameter as value around which either extinct almost-surely survives positive probability. We analyze existence phase-transition regarding survival rumor, obtain estimates for mean range rumor. applicability our results illustrated examples trees generated from some well-known discrete distributions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

On Random Binary Trees

A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally . A generating function for the number of nodes given height is developed and used to find the a...

متن کامل

On Random Cartesian Trees

Cartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. lithe search key and the priority key are independent, and the tree is built . based on n independent copies, Cartesian trees basically behave like ordinary random binary search trees . In this article, we analyze the expected behavior when the keys are dependent : in most ...

متن کامل

Random Sequential Adsorption on Random Trees

AIDAN SUDBURY MONASH UNIVERSITY Abstract. When gas molecules bind to a surface they may do so in such a way that the adsorption of one molecule inhibits the arrival of others. Two models which have frequently been studied are the “dimer model” and the “blocking model”, and rather complete solutions for these are known on fixed tree structures or Bethe lattices. In this paper comparisons are mad...

متن کامل

Stochastic Belief Propagation on Trees

For exact inference, Belief Propagation(BP) on trees requires O(Td2) operations, where T is the number of variables and d is the cardinality of all hidden variables. This quadratic complexity becomes prohibitive when d is large. Stochastic Belief Propagation(SBP)[1] is an approximate inference algorithm which utilizes subtle changes to original BP in order to achieve O(1/ √ τ) error in O(τTd) t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2021

ISSN: ['1742-5468']

DOI: https://doi.org/10.1088/1742-5468/ac3b45